0% completed
Problem Statement
Given two strings, word1 and word2, return the merged string after merging each character of both strings in alternate order, starting with the word1. If one string is longer than the other, append the remaining characters of the longer string to the end of the merged string.
Examples
-
Example 1:
- Input: word1:
"dog", word2:"cat" - Expected Output:
"dcoagt" - Justification: The characters from both strings are alternated, starting with the first character of the first string. Since both strings are of equal length, no extra characters remain at the end.
- Input: word1:
-
Example 2:
- Input: word1:
"hello", word2:"hi" - Expected Output:
"hheillo" - Justification: After alternating characters from both strings, the remaining characters from the longer string ("hello") are appended to the end.
- Input: word1:
-
Example 3:
- Input: word1:
"abc", word2:"xyz123" - Expected Output:
"axbycz123" - Justification: Characters are alternated, and since the second string is longer, the remaining characters ("123") are appended to the end.
- Input: word1:
Solution
To solve this problem, we'll iterate over both strings simultaneously, appending one character from each string to the result until we reach the end of one of the strings. This approach ensures that characters are merged in an alternating fashion, preserving the order from both input strings. After completing the alternating merge, if one string is longer, we append the remaining characters of the longer string to the merged result. This method is effective because it directly addresses the problem's requirements with a straightforward iteration, making it easy to understand and implement. By iterating over the strings simultaneously, we minimize the time complexity, ensuring that each character is visited only once, which makes the algorithm efficient for strings of varying lengths.
Step-by-Step Algorithm
- Initialize an empty string
resultto store the merged output. - Determine the length of the shorter string to ensure the alternating merge doesn't exceed the shorter string's length.
- Use a loop to iterate through both strings up to the length of the shorter string. During each iteration:
- Append the current character from the first string to
result. - Append the current character from the second string to
result.
- Append the current character from the first string to
- After completing the alternating merge, check if any string has remaining characters. Append the remaining characters from the longer string to
result. - Return the
resultstring.
Algorithm Walkthrough
Consider the input: word1: "abc", word2: "xyz123"
-
Initialize Variables:
resultis an empty string where the merged output will be stored.- Determine the length of the shorter string. In this case,
word1has a length of 3, andword2has a length of 6. So, the length of the shorter string is 3.
-
Start Looping Through Both Strings:
- For
i = 0(first iteration):- Append the first character of
word1("a") toresult. Now,result= "a". - Append the first character of
word2("x") toresult. Now,result= "ax".
- Append the first character of
- For
i = 1(second iteration):- Append the second character of
word1("b") toresult. Now,result= "axb". - Append the second character of
word2("y") toresult. Now,result= "axby".
- Append the second character of
- For
i = 2(third iteration):- Append the third character of
word1("c") toresult. Now,result= "axbyc". - Append the third character of
word2("z") toresult. Now,result= "axbycz".
- Append the third character of
- For
-
Check for Remaining Characters:
- At this point,
word1is fully iterated through, butword2still has characters left ("123"). - Since
word1is shorter and fully merged, we append the remaining characters ofword2toresult. Now,result= "axbycz123".
- At this point,
-
Return the Result:
- The final merged string is "axbycz123", which is stored in
result. - Return
result.
- The final merged string is "axbycz123", which is stored in
Code
Complexity Analysis
-
Time Complexity:
, where N is the length of the first string and M is the length of the second string. This is because the algorithm iterates through both strings once. -
Space Complexity:|
, due to the storage requirements for the resulting string which combines characters from both input strings.
On this page
Problem Statement
Examples
Solution
Step-by-Step Algorithm
Algorithm Walkthrough
Code
Complexity Analysis